Time-optimal tree computations on sparse meshes
نویسندگان
چکیده
منابع مشابه
Time-Optimal Tree Computations on Sparse Meshes
The main goal of this work is to fathom the suitability of the mesh with multiple broadcasting architecture (MMB) for some tree-related computations. We view our contribution at two levels: on the one hand we exhibit time lower bounds for a number of tree-related problems on the MMB. On the other hand, we show that these lower bounds are tight by exhibiting time-optimal tree algorithms on the M...
متن کاملTime-Optimal Nearest-Neighbor Computations on Enhanced Meshes
The All-Nearest Neighbor problem (ANN, for short) is stated as follows: given a set S of points in the plane, determine for every point in S, a point that lies closest to it. The ANN problem is central to VLSI design, computer graphics, pattern recognition, and image processing, among others. In this paper we propose time-optimal algorithms to solve the ANN problem for an arbitrary set of point...
متن کاملTime-optimal Proximity Graph Computations on Enhanced Meshes
In pattern recognition, morphology, and cellular system design one is interested in objects routinely represented by a polygon P. Distance properties among the vertices of P are one of the fundamental descriptors useful in shape analysis and clustering. In order to capture perceptually relevant features of P one associates a variety of proximity graphs with the polygon P. Typically such a proxi...
متن کاملSparse Suffix Tree Construction in Optimal Time and Space
Suffix tree (and the closely related suffix array) are fundamental structures capturing all substrings of a given text essentially by storing all its suffixes in the lexicographical order. In some applications, such as sparse text indexing, we work with a subset of b interesting suffixes, which are stored in the so-called sparse suffix tree. Because the size of this structure is Θ(b), it is nat...
متن کاملSparse Computations on GPGPUs
Sparse matrix computations are ubiquitous in scientific computing; General-Purpose computing on Graphics Processing Units (GPGPU) is fast becoming a key component of high performance computing systems. It is therefore natural that a substantial amount of effort has been devoted to implementing sparse matrix computations on GPUs. In this paper, we discuss our work in this field, starting with th...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Discrete Applied Mathematics
سال: 1997
ISSN: 0166-218X
DOI: 10.1016/s0166-218x(97)00135-2